Stroke Extraction and Approximation with Interpolating Lagrange Curves
ثبت نشده
چکیده
This paper proposes a stroke extraction method for use in off-line signature verification. After giving a brief overview of the current ongoing researches an algorithm is introduced for detecting and following strokes in static images of signatures. Problems like the handling of junctions and variations in line width and line intensity are discussed in detail. Results are validated by both using an existing on-line signature database and by employing image registration methods. Keywords—Stroke extraction, spline fitting, off-line signature verification, image registration.
منابع مشابه
Evaluation of New MOND Interpolating Function with Rotation Curves of Galaxies
The rotation curves of a sample of 46 low- and high-surface brightness galaxies are considered in the context of Milgrom's modi_ed dynamics (MOND) to test a new interpolating function proposed by Zhao et al. (2010) [1] and compare with the results of simple interpolating function. The predicted rotation curves are calculated from the total baryonic matter based on the B-band surface photometry,...
متن کاملPointwise Simultaneous Convergence of Extended Lagrange Interpolation with Additional Knots
In numerical analysis it is important to construct interpolating polynomials approximating a given function and its derivatives simultaneously. The authors define some new good interpolating matrices with "many" nodes close to the endpoints of the interval and also give error estimates.
متن کاملOn the best conditioned bases of quadratic polynomials
It is known that for Pn, the subspace of C([−1, 1]) of all polynomials of degree at most n, the least basis condition number κ∞(Pn) (also called the Banach-Mazur distance between Pn and `n+1 ∞ ) is bounded from below by the projection constant of Pn in C([−1, 1]). We show that κ∞(Pn) is in fact the generalized interpolating projection constant of Pn in C([−1, 1]), and is consequently bounded fr...
متن کاملBridging Bernstein and Lagrange polynomials
Linear combinations of iterates of Bernstein polynomials exponentially converging to the Lagrange interpolating polynomial are given. The results are applied in CAGD to get an exponentially fast weighted progressive iterative approximation technique to fit data with finer and finer precision. AMS subject classifications: 41A25, 41A36
متن کاملA survey on bivariate Lagrange interpolation on Lissajous nodes
This article is a survey on recent research on bivariate polynomial interpolation on the node points of Lissajous curves. The resulting theory is a generalization of the generating curve approach developed for Lagrange interpolation on the Padua points. After classifying the different types of Lissajous curves, we give a short overview on interpolation and quadrature rules defined on the node p...
متن کامل